home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: news.inap.net!news1!ind-004-236-188
- From: dlmiller@iquest.net (Doug Miller)
- Subject: Re: polyg. inters. in C
- X-Nntp-Posting-Host: ind-004-236-188.iquest.net
- Message-ID: <DpAILH.38H@iquest.net>
- Sender: news@iquest.net (News Admin)
- Organization: IQuest Network Services
- X-Newsreader: News Xpress Version 1.0 Beta #2.1
- References: <1996Apr2.151123.3829@dcs.warwick.ac.uk>
- Date: Wed, 3 Apr 1996 14:24:51 GMT
-
- D.C.Molero@dcs.warwick.ac.uk (danny) wrote:
- >Dear Readers,
- >
- >I have what to me seems a complicated algorithmic problem and would
- >like very much to hear your suggestions.
- >
- >Given two polygons A and B, is it possible to know whether B is
- >contained in A, with possibly A and B sharing some sides ?
- >If so, is it possible to calculate A - B, that is, the polygon obtained
- >when the intersection of A and B is substracted from A ??
- >
- >I haven't found any bibliography dealing with it.
- >
- >I would need some C code to solve it, so C code itself or pseudocode, or
- >any refernce to any materials where I can find the solution, would be
- >greatly appreciated.
- >
- >Thank you for reading my message.
- >
- >--
- >* Daniel Castillo. danmol@dcs.warwick.ac.uk *
- >
- >
- Well, Danny, I think this is one homework assignment you're just going to have to do on your own.
-